Oblique Multicategory Decision Trees Using Nonlinear Programming
نویسندگان
چکیده
منابع مشابه
Oblique Multicategory Decision Trees Using Nonlinear Programming
I of decision trees is a popular and effective method for solving classification problems in data-mining applications. This paper presents a new algorithm for multi-category decision tree induction based on nonlinear programming. This algorithm, termed OC-SEP (Oblique Category SEParation), combines the advantages of several other methods and shows improved generalization performance on a collec...
متن کاملInduction of Oblique Decision Trees
This paper introduces a randomized technique for partitioning examples using oblique hyperplanes. Standard decision tree techniques , such as ID3 and its descendants, partition a set of points with axis-parallel hyper-planes. Our method, by contrast, attempts to nd hyperplanes at any orientation. The purpose of this more general technique is to nd smaller but equally accurate decision trees tha...
متن کاملDecision Forests with Oblique Decision Trees
Ensemble learning schemes have shown impressive increases in prediction accuracy over single model schemes. We introduce a new decision forest learning scheme, whose base learners are Minimum Message Length (MML) oblique decision trees. Unlike other tree inference algorithms,MMLoblique decision tree learning does not over-grow the inferred trees. The resultant trees thus tend to be shallow and ...
متن کاملA new way to build Oblique Decision Trees using Linear Programming
Adding linear combination splits to decision trees allows multivariate relations to be expressed more accurately and succinctly than univariate splits alone. In order to determine an oblique hyperplane which distinguishes two sets, linear programming is proposed to be used. This formulation yields a straightforward way to treat missing values. Computational comparison of that linear programming...
متن کاملUsing Oblique Decision Trees for the Morphological Classification of Galaxies
We discuss the application of a class of machine learning algorithms known as decision trees to the process of galactic classification. In particular, we explore the application of oblique decision trees induced with different impurity measures to the problem of classifying galactic morphology data provided by Storrie-Lombardi et al. (1992). Our results are compared to those obtained by a neura...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Journal on Computing
سال: 2005
ISSN: 1091-9856,1526-5528
DOI: 10.1287/ijoc.1030.0047